package leetcode.D2000.T1905;

import util.GraphUtil;

/**
 * @File Info: leetcode -- <M1905>
 * @Author: 18362
 * @Create: 2022-02-26 17:09:54 星期六
 */
public class M1905 {
    public static void main(String[] args) {
        int[][] grid1 = GraphUtil.parseGraph("[[1,1,1,0,0],[0,1,1,1,1],[0,0,0,0,0],[1,0,0,0,0],[1,1,0,1,1]]");
        int[][] grid2 = GraphUtil.parseGraph("[[1,1,1,0,0],[0,0,1,1,1],[0,1,0,0,0],[1,0,1,1,0],[0,1,0,1,0]]");
        System.out.println(new Solution().countSubIslands(grid1, grid2));
    }
}
